Skip to content

feat: add Weighted Interval Scheduling using DP and Binary Search#1883

Open
Neha-2005-VCE wants to merge 3 commits intoTheAlgorithms:masterfrom
Neha-2005-VCE:feat/weighted-interval-scheduling
Open

feat: add Weighted Interval Scheduling using DP and Binary Search#1883
Neha-2005-VCE wants to merge 3 commits intoTheAlgorithms:masterfrom
Neha-2005-VCE:feat/weighted-interval-scheduling

Conversation

@Neha-2005-VCE
Copy link

Added Weighted Interval Scheduling algorithm.

  • Uses Dynamic Programming and Binary Search
  • Time Complexity: O(n log n)
  • Space Complexity: O(n)
  • Includes unit tests

This implementation finds the maximum profit such that no intervals overlap.

Loading
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants